Informatics Publishing Limited

Anuradha Banerjee ¹, Kinshuk Majumder ²

Affiliations
1 Dept. of Computer Applications, IN
2 CSE Dept., IN

Abstract

Now-a-days, Information Technology Enabled Services (ITES) has proved itself to be the fastest growing segment of IT industry, with it's components being, call centre services. Medical transcription and Animation, Telemarketing, Data Processing for banks. Insurance companies, Payroll System etc. ITES has registered an impressive systems etc. ITES has registered an impressive growth of 65% in business as Rs. 117/ - bn in 2002-03 against 71 bn in 2001-02. ITES share in total exports was 24% against 19% in 2001-02 and 14.5% in 1999-01. It is expected that by the year 2008, a huge job pool of 1.1 millions will be created.

Full Text

   

Abu Sufian ¹, Anuradha Banerjee ², Paramartha Dutta ³

Affiliations
1 University of Gour Banga, Malda - 732103, West Bengal, IN
2 Kalyani Government Engineering College, Kalyani - 741235, West Bengal, IN
3 Visva-Bharati University, Santiniketan, Bolpur - 731235, West Bengal, IN

Abstract

In ad hoc networks, the scheduling of route-request packets should be different from that of message packets, because during transmission of message packets the location of the destination is known whereas in route discovery this is not known in most of the cases. The router has to depend upon the last known location, if any, of the destination to determine the center and radius of the circle that embeds all possible current position of the destination. Route-request packets generated from the source are directed towards this circle i.e., directional route discovery can be applied. Otherwise, when no earlier location of the destination is known the route-requested has to be broadcast in the whole network consuming a significant amount of time than directional route discovery. The present article proposes a fuzzy controlled scheduling of route-request packets in particular that greatly reduces the average delay in route discovery in ad hoc networks.

Keywords

Ad Hoc Networks, Delay, Embedding Circle, Route-Request, Scheduling.

Full Text

   

Anuradha Banerjee ¹, Paramartha Dutta ², Abu Sufian ³

Affiliations
1 Department of Computer Applications, Kalyani Govt. Engg. College, Nadia, Kalyani – 741127, West Bengal, IN
2 Department of Computer and Systems Science, Visva-Bharati University, Bolpur – 731235, West Bengal, IN
3 Department of Computer Science, University of Gour Banga, Maida – 732103,West Bengal, IN

Abstract

Nodes in ad hoc networks have limited battery power. Hence they require energy-efficient technique to improve average network performance. Maintaining energy-efficiency in ad hoc networks is really challenging because highest energyefficiency is achieved if all the nodes are always switched off and energy-efficiency will be minimum if all the nodes are fully operational i.e. always turned-on. Energy preservation requires redirection of data packets through some other routes having good performance. This improves data packet delivery ratio and number of alive nodes decreasing cost of messages.

Keywords

Ad Hoc Networks, Congestion, Delay, Energy Preservation, Fuzzy-Controller, Network Partition.

Full Text

   

Anuradha Banerjee , Paramartha Dutta

Abstract

Ad hoc networks are collections of mobile nodes communicating with each other using wireless media without any fixed infrastructure. During both route discovery and traversal of route-reply packets from destination to source, broadcast of packets is required which incurs huge message cost. The present article deals with the message cost reduction during transmission of route-reply from destination to source. Also the redundancy that is visible within the 2-hop neighborhood of a node is minimized during broadcasting of route-reply. This improves the average lifetime of network nodes by decreasing the possibility of network partition. The scheme of 2NI can be used with any reactive routing protocol in MANETs.

Keywords

Ad Hoc Networks, Broadcast Balloon, Cost-Effective, Route-Request, Route-Reply, Two-Hop Neighborhood Information.

Full Text

   

Anuradha Banerjee ¹, Paramartha Dutta ²

Affiliations
1 Kalyani Govt. Engg. College, Kalyani, Nadia, IN
2 Dept. of Computer and System Science, Visva-Bharati University, Santiniketan, IN

Abstract

A mobile ad hoc network is an infrastructure-less network where the nodes are free to move independently in any direction. The nodes have limited power and their set of neighbours, both uplink and downlink, change with time due to the inherent dynamism of the nodes. When multiple message forwarding requests arrive at one particular node, it needs to arrange them within its queue according to a suitable scheduling algorithm that is energy efficient as well as concerned about the relative velocity of the associated nodes. The present article proposes one such scheduling algorithm DEV-NS (Delay-efficient Energy and Velocity Conscious Nonpreemptive Scheduler) that instructs each node to assign weights to its uplink neighbours at regular intervals. Message forwarding request from the uplink neighbour with highest weight is served first. Simulation results clearly establish the fact that among all the state-of-the-art scheduling algorithms, DEV-NS produces much better result in terms of end-to-end delay, message cost, network throughput and connectivity ratio.

Keywords

Ad Hoc Network, Delay-Efficiency, Energy, Non-Preemption, Scheduling, Velocity, Weight.

Full Text

   

Anuradha Banerjee ¹, Paramartha Dutta ²

Affiliations
1 Department of Computer Applications, Kalyani Govt. Engg College, West Bengal, IN
2 Department of Computer and Systems Science, Visva-Bharati University, Santiniketan, West Bengal, IN

Abstract

A mobile ad hoc network is an infrastructure less network, where nodes are free to move independently in any direction. The nodes have limited battery power; hence we require efficient balancing techniques (energy depletion or expected residual lifetime, whichever is applicable under specific circumstances) to reduce overload on the nodes, wherever possible, to enhance their lifetime and network performance. This kind of balance among network nodes increase the average lifetime of nodes and reduce the phenomenon of network partitioning due to excessive exhaustion of nodes. In this paper, we propose an alternative-node based balancing method (ANB) that channels the forwarding load of a node to some other less exhausted alternative node provided that alternative node is capable of handling the extra load. This greatly reduces the number of link breakages and also the number of route-requests flooded in the network to repair the broken links. This, in turn, improves the data packet delivery ratio of the underlying routing protocol as well as average node lifetime.

Keywords

Ad Hoc Network, Alternative Node, Energy Depletion, Link Breakage, Expected Residual Lifetime Balancing.

Full Text

   

Anuradha Banerjee ¹, Subhankar Ghosh ²

Affiliations
1 Kalyani Govt. Engg. College, Kalyani, Nadia West Bengal, IN
2 Department of Computer Science and Engineering, Research Scholar, Kalyani Govt. Engg. College, IN

Abstract

These days UAV-IOT collaborative environment has become a hot topic for research because UAV adds significant potential to the IoT devices. However, there are multiple issues to address like resource allocation, trajectory optimization energy preservation, selfish and malicious node detection etc. In this article we propose a decision tree based selfish and malicious node detection technique based upon information like residual energy, energy depletion rate, present reputation and credibility of alternative routers. Based on this, next reputation is decided and the node is identified as non-malicious or malicious. During selection of route from clusterhead to a cluster member, malicious nodes are avoided as much as possible, to reduce unnecessary consumption of energy and time.

Keywords

Credit, Energy Efficiency, Malicious, Random Forest, Unmanned Aerial Vehicle.

Full Text